Copyright Warning & Restrictions

نویسنده

  • Jian-Guo Chen
چکیده

ADAPTIVE DISTRIBUTED DETECTION WITH APPLICATIONS TO CELLULAR CDMA by Jian-Guo Chen Chair and Varshney have derived an optimal rule for fusing decisions based on the Bayesian criterion. To implement the rule, probabilities of detection PD and false alarm PF for each detector must be known, which is not readily available in practice. This dissertation presents an adaptive fusion model which estimates the PD and PF adaptively by a simple counting process. Since reference signals are not given, the decision of a local detector is arbitrated by the fused decision of all the other local detectors. Adaptive algorithms for both equal probable and unequal probable sources, for independent and correlated observations are developed and analyzed, re3pectively. The convergence and error analysis of the system are analytically proven and demonstrated by simulations. In addition, in this dissertation, the performance of four practical fusion rules in both independent and correlated Gaussian noise is analyzed, and compared in terms of their Receiver Operating Characteristics (ROCs). Various factors that affect the fusion performance are considered in the analysis. By varying the local decision thresholds, the ROCs under the influence of the number of sensors, signal-to-noise ratio (SNR), the deviation of local decision probabilities, and correlation coefficient, are computed and plotted, respectively. Several interesting and key observations on the performance of fusion rules are drawn from the analysis. As an application of the above theory, a decentralized or distributed scheme in which each fusion center is connected with three widely spaced base stations is proposed for digital cellular code-division multi-access communications. Detected results at each base station are transmitted to the fusion center where the final decision is made by optimal fusion. The theoretical analysis shows that this novel structure can achieve an error probability at the fusion center which is always less than or equal to the minimum of the three respective base station. The performance comparison for binary coherent signaling in Rayleigh fading and lognormal shadowing demonstrates that the decentralized detection has a significant increased system capacity over conventional macro selection diversity. This dissertation analyzes the performance of the adaptive fusion method for macroscopic diversity combination in the wireless cellular environment when the error probability information from each base station detection is not available. The performance analysis includes the derivation of the minimum achievable error probability. An alternative realization with lower complexity of the optimal fusion scheme by using selection diversity is also proposed. The selection of the information bit in this realization is obtained either from the most reliable base station or through the majority rule from the participating base stations. ADAPTIVE DISTRIBUTED DETECTIONWITH APPLICATIONS TO CELLULAR CDMA

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Warning Concerning Copyright Restrictions

ness of the general, shown only in the very function good will may have in this world of ours, his novels seem to have a singular appeal, as though he wanted to say: This man of good will may be anybody and everybody, perhaps even you and me. Foreign Afl

متن کامل

Synchronized and asynchronous parallel algorithms for multiprocessors

NOTICE WARNING CONCERNING COPYRIGHT RESTRICTIONS: The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying of this document without permission of its author may be prohibited by law. Abstract Parallel algorithms for multiprocessors are classified into synchronized and asynchronous algorithms. Impor...

متن کامل

Monotone Circuits for Connectivity Have Depth (log N) 2?o(1)

We prove that a monotone circuit of size n d recognizing connectivity must have depth ((log n) 2 = log d). For formulas this implies depth ((log n) 2 = log log n). For polynomial-size circuits the bound becomes ((log n) 2) which is optimal up to a constant. Warning: Essentially this paper has been published in SIAM Journal on Computing is hence subject to copyright restrictions. It is for perso...

متن کامل

Composition of the Universal Relation

We prove that the communication complexity of the k-fold composition of the universal relation on n bits is (1 o(1))kn when k = o( p n= logn). Warning: Essentially this paper has been published in Advances in Computational Complexity Theory and is hence subject to copyright restrictions. It is for personal use only.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011